Computing Along the Critical Path
نویسندگان
چکیده
Modern processors come close to executing as fast as true dependencies allow. The particular dependencies that constrain execution speed constitute the critical path of execution. To optimize the performance of the processor, we either have to reduce the critical path or execute it more efficiently. In both cases, it can be done more effectively if we know the actual path. This paper describes a Critical Path Profiler for efficiently finding the critical dependence path through the complete execution of a program. It is intended to be used for profile-based compiler and processor optimizations. Unlike other critical-path based tools which analyze dependences along a single most-likely path (trace), this one analyzes dependences along every taken path through the code. We present data on the SPEC benchmark suite gathered through the profiler and experiment with potential uses for the profiler as a static critical-path predictor.
منابع مشابه
Slack: A New Performance Metric for Parallel Programs
Critical Path Profiling is a technique that provides guidance to help programmers try to improve the running time of their program. However, Critical Path Profiling provides only an upper bound estimate of the improvement possible in a parallel program execution. In this paper, we present a new metric, called Slack , to complement Critical Path and provide additional information to parallel pro...
متن کاملAnalysis of critical paths in a project network with random fuzzy activity times
Project planning is part of project management, which is relates to the use of schedules such as Gantt charts to plan and subsequently report progress within the project environment. Initially, the project scope is defined and the appropriate methods for completing the project are determined. In this paper a new approach for the critical path analyzing a project network with random fuzzy activi...
متن کاملEvolutionary Computing Assisted Wireless Sensor Network Mining for QoS-Centric and Energy-efficient Routing Protocol
The exponential rise in wireless communication demands and allied applications have revitalized academia-industries to develop more efficient routing protocols. Wireless Sensor Network (WSN) being battery operated network, it often undergoes node death-causing pre-ma...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملAn approximate analytical solution of the Bethe equation for charged particles in the range of radiotherapy energy
Charged particles such as protons and carbon ions are an increasing tool in radiation therapy. However, unresolved physical problems prevent optimal performance, including estimating the deposited dose in non-homogeneous tissue, is an essential aspect of optimizing treatment. The Monte Carlo (MC) method can be used to estimate the amount of radiation, but, this powerful computing operation is v...
متن کامل